MT2Way Interaction Algorithm for Pairwise Test Data Generation
نویسندگان
چکیده
To reduce the number of test cases by utilized the minimum possible amount of time throughout the testing process of software and hardware is highly desirable. For ensuring the stability of the technique the combination of a complete set of available inputs is recommended to be executed. But generally an exhaustive numbers of test cases are hard to execute. Therefore, test data generation is an NP-hard (non-deterministic polynomial-time hard) problem. This is likely to present significant issues in difficulties interpreting the best possible method for generating the test data. The reduction of test cases usually depends on the interaction level. 2-way interaction or pair wise test data can reduce high number of test cases. This efficiently addresses most of the software errors. In this paper has been addressed an effective 2-way interaction algorithm to generate the test data which is more acceptable in terms of the number of test cases.
منابع مشابه
Anatomy of the Parallel Tree Based Strategy for High Strength Interaction Testing
Software and hardware testers concentrate on how to minimize the time involved in testing at the same time to ensure that the system is also tested well and made acceptable. This paper has enhanced and explained in details our previous strategy “A Tree Based Strategy for Test Data Generation and Cost Calculation for Pairwise Combinatorial Interaction Testing” to work effectively in parallel and...
متن کاملAnatomy of the Tree Based Strategy for High Strength Interaction Testing
The amount of resources consumed for a complete and exhaustive testing becomes unreasonable and unaffordable. While it is vital to assure the quality and the reliability of any system, it is impossible to do an exhaustive testing due to the huge number of possible combinations. To bring a balance between exhaustive testing and lack of testing combinatorial interactions testing has been adopted....
متن کاملAutomated Test Data Generation Based On Matching Combination and Testing Matrix For Pairwise Testing
Based on the model of matrix, a new algorithm for original pairwise testing data set generation is first proposed, and then, based on which, a sufficient and necessary condition for the minimum pairwise testing data set generation of the testing system T is given, where T has n different parameters, each parameter has n different values, and n is a prime number. Finally, according to the given ...
متن کاملIRPS - An Efficient Test Data Generation Strategy for Pairwise Testing
Software testing is an integral part of software engineering. Lack of testing often leads to disastrous consequences including loss of data, fortunes, and even lives. In order to ensure software reliability, many combinations of possible input parameters, hardware/software environments, and system configurations need to be tested and verified against for conformance. Due to costing factors as w...
متن کاملOptimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing
Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012